A Clause Tableau Calculus for MaxSAT
نویسندگان
چکیده
We define a clause tableau calculus for MaxSAT, prove its soundness and completeness, and describe a tableau-based algorithm for MaxSAT. Given a multiset of clauses , the algorithm computes both the minimum number of clauses that can be falsified in , and an optimal assignment. We also describe how the algorithm can be extended to solve weighted MaxSAT and weighted partial MaxSAT.
منابع مشابه
Redundancy for rigid clausal tableaux
Redundancy is a substantial concept when avoiding endless computation in theorem proving methods. In this paper, we are targeting a special class of tableau calculi, namely rigid clausal tableaux. These tableaux are (1) clausal in the sense that they consist solely of literals, and are (2) rigid in the sense that they employ rigid variables. Such calculi are e.g. rigid hyper tableaux [7] and mu...
متن کاملProlog Extensions Based on Tableau Calculus
The intention of this paper is to help bridging the gap between logic programming and theorem proving. It presents the design of a Gentzen type proof search procedure, based on classical tableau calculus, for knowledge bases consisting of arbitrary first order formulas. At each proof search step, when a new formula is to be chosen from the knowledge base, the procedure chooses in such a way tha...
متن کاملUsing Learnt Clauses in maxsat
maxsat is an optimization version of SAT capable of expressing a variety of practical problems. maxsat solvers have been designed to take advantage of many of the successful techniques of SAT solvers. However, the most important technique of modern SAT solvers, clause learning, has not been utilized since learnt clauses cannot be soundly added to a maxsat theory. In this paper we present a new ...
متن کاملProof Confluent Tableau Calculi
A tableau calculus is proof confluent if every partial tableau proof for an unsatisfiable formula can be extended to a closed tableau. A rule application may be redundant but it can never prevent the construction of a proof; there are no “dead ends” in the proof search. Proof confluence is a prerequisite of (a) backtrackingfree proof search and (b) the generation of counter examples to non-theo...
متن کاملA Theorem Prover for Equality using Lemmas
Equality handling has been traditionally one of the weaknesses of tableau-based theorem provers in general, from which those based on the Connection Tableau Calculus are not an exception. The Intermediate Lemma Extension is based on a simple extension to Logic Programming in which positive subgoals are skipped and all clauses treated as Horn clauses, allowing to derive clauses consisting of onl...
متن کامل